A Simple Explicit-Implicit FETI Transient Analysis Algorithm

نویسندگان

  • José A. González
  • K. C. Park
چکیده

A simple explicit-implicit FETI transient analysis procedure is presented, which utilizes the same basic FETI solver developed for static structural analysis problems. A key concept for the present algorithm is to integrate d’Alembert-Lagrange principal equations, viz., the domain-by-domain floating dynamic selfequilibrium equations, by an explicit algorithm. The remaining deformation modes are then integrated by an unconditionally stable implicit integration algorithm, thus achieving overall unconditional stability. The resulting interface problem possesses the same solution matrix profile as the basic FETI static problems. The present simple dynamic algorithm, as expected, falls short of the performance of the FETI-DP but offers a similar performance of implicit two-level FETI-D with a much cheaper coarse solver; hence, its simplicity may offer relatively easy means for conducting parallel analysis of both static and dynamic problems by employing the same basic scalable FETI solver, especially for research-mode numerical experiments. Copyright c © 2011 John Wiley & Sons, Ltd.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simple explicit–implicit finite element tearing and interconnecting transient analysis algorithm

A simple explicit–implicit finite element tearing and interconnecting (FETI) algorithm (AFETI-EI algorithm) is presented for partitioned transient analysis of linear structural systems. The present algorithm employs two decompositions. First, the total system is partitioned via spatial or domain decomposition to obtain the governing equations of motions for each partitioned domain. Second, for ...

متن کامل

A Simple Explicit Guidance Scheme Based on Velocities-to-be-Gained.

In this paper, a closedloop strategy in the vertical plane is derived in order to determine the thrust direction of a launch vehicle in terms of velocitiestobe gained The two velocities-to-be-gained are utilized, here, for a given altitude and zero vertical speed in a specied nal time The formulation is obtained for constant gravity assumption, but it works when the velocitiesto-be-gained are o...

متن کامل

FETI–DP, BDDC, and Block Cholesky Methods

Two popular non-overlapping domain decomposition methods, the FETI–DP and BDDC algorithms, are reformulated using Block Cholesky factorizations, an approach which can provide a useful framework for the design of domain decomposition algorithms for solving symmetric positive definite linear system of equations. Instead of introducing Lagrange multipliers to enforce the coarse level, primal conti...

متن کامل

Strong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings

In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space  with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p

متن کامل

Evaluating the Effectiveness of Explicit and Implicit Form-Focused Instruction on Explicit and Implicit Knowledge of EFL Learners

Although explicit and implicit knowledge of language learners are essential to theoretical and pedagogical debates in second language acquisition (SLA), little research has addressed the effects of instructional interventions on the two knowledge types (R. Ellis, 2005).This study examined the relative effectiveness of explicit and implicit types of form-focused instruction (FFI) on the acquisit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011